Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(f(a,a),x) |
→ f(a,f(b,f(a,x))) |
| 2: |
|
f(x,f(y,z)) |
→ f(f(x,y),z) |
|
There are 5 dependency pairs:
|
| 3: |
|
F(f(a,a),x) |
→ F(a,f(b,f(a,x))) |
| 4: |
|
F(f(a,a),x) |
→ F(b,f(a,x)) |
| 5: |
|
F(f(a,a),x) |
→ F(a,x) |
| 6: |
|
F(x,f(y,z)) |
→ F(f(x,y),z) |
| 7: |
|
F(x,f(y,z)) |
→ F(x,y) |
|
The approximated dependency graph contains one SCC:
{3-7}.
-
Consider the SCC {3-7}.
By taking the AF π with
π(f) = π(F) = 1 together with
the lexicographic path order with
precedence a ≻ b,
the rules in {1-3,5-7}
are weakly decreasing and
rule 4
is strictly decreasing.
There is one new SCC.
-
Consider the SCC {3,5-7}.
The constraints could not be solved.
Tyrolean Termination Tool (0.02 seconds)
--- May 4, 2006